package main.java.indi.zyj.c150.dp;

public class _22_MinDistance {


    int minDistance(String s1, String s2) {

        int x = s1.length();
        int y = s2.length();

        int[][] dp = new int[x+1][y+1];

        for (int i = 0; i <= x; i++) {
            dp[0][i] = i;
        }
        for (int i = 0; i < y; i++) {
            dp[i][0] = i;
        }

        for (int i = 1; i <= x; i++) {
            for (int j = 1; j <= y; j++) {
                if (s1.charAt(i) == s2.charAt(j)){
                    dp[i][j] = dp[i-1][j-1];
                }else {
                    dp[i][j] = Math.min(dp[i - 1][j] + 1, Math.min(dp[i][j - 1] + 1, dp[i - 1][j - 1] + 1)
                    );
                }
            }
        }

        return dp[x][y];

    }

}
